Online Interval Coloring with Packing Constraints
نویسندگان
چکیده
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth
منابع مشابه
On Bin Packing with Conflicts
We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . . , sn ∈ [0, 1] and a conflict graph G = (V, E), the goal is to find a partition of the items into independent sets of G, where the total size of each independent set is at most one, so that the number of independent sets in the...
متن کاملOnline Coloring Co-interval Graphs
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on the real line is presented to the online algorithm in some arbitrary order, and the algorithm must assign each interval a color that is different from the colors of all previously presented intervals not intersecting the current interval. It is known that the competitive ratio of the simple First-...
متن کاملA Note on Circular Arc Online Coloring using First Fit
In [1] using a column construction technique it is proved that every interval graph can be colored online with First Fit with at most 8w(G) colors, where w(G) is the size of the maximum clique of G. Since the column construction can not be adapted to circular arc graphs we give a different proof to establish an upper bound of 9w(G) for online coloring a circular arc graph G with the First Fit a...
متن کاملLower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints
We propose two strategies for Presenter in the on-line interval graph coloring games. Specifically, we consider a setting in which each interval is associated with a d-dimensional vector of weights and the coloring needs to satisfy the d-dimensional bandwidth constraint, and the k-cardinality constraint. Such a variant was first introduced by Epstein and Levy and it is a natural model for resou...
متن کاملBeating the Harmonic Lower Bound for Online Bin Packing
In the online bin packing problem, items of sizes in (0, 1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we present an online bin packing algorithm with asymptotic performance ratio of 1.5815, which constitutes the first improvement over the algorithm HARMONIC++ in fifteen years and reduces the gap to the lower bound by roughly ...
متن کامل